Shared processor scheduling of multiprocessor jobs
نویسندگان
چکیده
منابع مشابه
Performance of Hierarchical Processor Scheduling in Shared-Memory Multiprocessor Systems
Processor scheduling policies can be broadly divided into space-sharing and time-sharing policies. Space-sharing policies partition system processors and each partition is allocated exclusively to a job. In time-sharing policies, processors are temporally shared by jobs (e.g., in a round robin fashion). Space-sharing policies can be either static (processor allocation remains constant during th...
متن کاملShared processor scheduling
We study the shared processor scheduling problem with a single shared processor where a unit time saving (weight) obtained by processing a job on the shared processor depends on the job. A polynomialtime optimization algorithm has been given for the problem with equal weights in the literature. This paper extends that result by showing an O(n log n) optimization algorithm for a class of instanc...
متن کاملShared multi-processor scheduling
We study shared multi-processor scheduling problem where each job can be executed on its private processor and simultaneously on one of many processors shared by all jobs in order to reduce the job’s completion time due to processing time overlap. The total weighted overlap of all jobs is to be maximized. The problem models subcontracting scheduling in supply chains and divisible load schedulin...
متن کاملScheduling Deteriorating Jobs on a Single Processor
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملOptima Localization in Scheduling Multi-Processor Jobs
The paper considers a multi-processor tasks scheduling problem with dedicated processors. The main target is determining the tight optima localization intervals for different sub-problems of the basic problem. Based on the ideas of a computer-aided technique developed in the paper by Sevastyanov and Chernykh [15] for shop scheduling problems, we elaborated a similar method for a different-type ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2020
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2019.09.033